Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings
نویسندگان
چکیده
This is the scientific report for the paper entitled “Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings”. This research produces a powerful idea for transforming any semi-honestly secure multiparty computation (MPC) into an actively secure protocol while taking into consideration reducing the threshold of tolerance corruption for real parties by semi-honest adversaries. An efficient compiler has introduced a new multiparty computation protocol for the important case of secure evaluation of arithmetic circuits over arbitrary rings (we show three parties). The first protocol for secure computation over arbitrary rings that achieves active security with constant overhead is produced in this research.
منابع مشابه
Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings
We present a very simple yet very powerful idea for turning any passively secure MPC protocol into an actively secure one, at the price of reducing the threshold of tolerated corruptions. Our compiler leads to a very efficient MPC protocols for the important case of secure evaluation of arithmetic circuits over arbitrary rings (e.g., the natural case of Z2 )̀ for small number of parties. We show...
متن کاملEfficient Multi-party Computation over Rings
Secure multi-party computation (MPC) is an active research area, and a wide range of literature can be found nowadays suggesting improvements and generalizations of existing protocols in various directions. However, all current techniques for secure MPC apply to functions that are represented by (boolean or arithmetic) circuits over finite fields. We are motivated by two limitations of these te...
متن کاملEfficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits
A central problem in cryptography is that of converting protocols that offer security against passive (or semi-honest) adversaries into ones that offer security against active (or malicious) adversaries. This problem has been the topic of a large body of work in the area of secure multiparty computation (MPC). Despite these efforts, there are still big efficiency gaps between the best protocols...
متن کاملMPC vs. SFE: Perfect Security in a Unified Corruption Model
Secure function evaluation (SFE) allows a set of players to compute an arbitrary agreed function of their private inputs, even if an adversary may corrupt some of the players. Secure multi-party computation (MPC) is a generalization allowing to perform an arbitrary on-going (also called reactive or stateful) computation during which players can receive outputs and provide new inputs at intermed...
متن کاملNew Modular Compilers for Authenticated Key Exchange
We present two new compilers that generically turn passively secure key exchange protocols (KE) into authenticated key exchange protocols (AKE) where security also holds in the presence of active adversaries. Security is shown in a very strong security model where the adversary is also allowed to i) reveal state information of the protocol participants and ii) launch theoretically and practical...
متن کامل